Speeding up Network Layout and Centrality Measures with NodeXL and the Nvidia CUDA Technology

نویسندگان

  • Puneet Sharma
  • Udayan Khurana
  • John Locke
چکیده

In this paper we talk about speeding up calculation of graph metrics and layout with NodeXL by exploiting the parallel architecture of modern day Graphics Processing Units (GPU), specifically Compute Unified Device Architecture (CUDA) by Nvidia. Graph centrality metrics like Eigenvector, Betweenness, Page Rank and layout algorithms like Fruchterman-Rheingold are essential components of Social Network Analysis (SNA). With the growth in adoption of SNA in different domains and increasing availability of huge networked datasets for analysis, social network analysts are looking for tools that are faster and more scalable. Our results show up to 802 times speedup for a FruchtermanRheingold graph layout and up to 17,972 times speedup for Eigenvector centrality metric calculations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Speeding Up Network Layout and Centrality Measures for Social Computing Goals

This paper presents strategies for speeding up calculation of graph metrics and layout by exploiting the parallel architecture of modern day Graphics Processing Units (GPU), specifically Compute Unified Device Architecture (CUDA) by Nvidia. Graph centrality metrics like Eigenvector, Betweenness, Page Rank and layout algorithms like Fruchterman-Rheingold are essential components of Social Networ...

متن کامل

Speeding up Network Layout and Centrality Measures with NodeXL and the Nvidia CUDA Technology ( 10 / 11 / 2010 )

In this paper we talk about speeding up calculation of graph metrics and layout with NodeXL by exploiting the parallel architecture of modern day Graphics Processing Units (GPU), specifically Compute Unified Device Architecture (CUDA) by Nvidia. Graph centrality metrics like Eigenvector, Betweenness, Page Rank and layout algorithms like Fruchterman-Rheingold are essential components of Social N...

متن کامل

Massive Parallelism with Gpus for Centrality Ranking in Complex Networks

Many problems in Computer Science can be modelled using graphs. Evaluating node centrality in complex networks, which can be considered equivalent to undirected graphs, provides an useful metric of the relative importance of each node inside the evaluated network. The knowledge on which the most central nodes are, has various applications, such as improving information spreading in diffusion ne...

متن کامل

Solutions of Speeding-up On-line Dynamic Signature Authentification

The article presents a study and its experimental results, over methods of speeding-up authentication of the dynamic handwritten signature, in the context of numerous requests. We will present 3 solutions that use parallel computation by using a 16 processor server, a FPGA development board and a video board, using nVidia CUDA technology.

متن کامل

The Influence of Location on Nodes’ Centrality in Location-Based Social Networks

Nowadays, due to the widespread use of social networks, they can be used as a convenient, low-cost, and affordable tool for disseminating all kinds of information and data among the massive users of these networks. Issues such as marketing for new products, informing the public in critical situations, and disseminating medical and technological innovations are topics that have been considered b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010